/**
*      author: Y_Yao
*      created: 2025-04-18 10:28:14
**/

#include<bits/stdc++.h>

#define int LL
using namespace std;
using LL = long long;
const LL LLINF = 9e18;
const int INF = 0x3f3f3f3f;
const int MX = 1e5 + 3;
int n,m;
struct node
{
    int u,v,w;
};

vector<node> ans;

void solve()
{
    cin >> n >> m; 
    int cnt = 0;
    for(int i = 1;i <= n - 2;i++)
    {
        cnt++;
        ans.push_back({i,i + 1,1});
    }

    ans.push_back({n-1,n,MX - cnt});
    cnt++;

    for(int i = 1;i <= n;i++)
    {
        for(int j = i + 2;j <= n;j++)
        {
            if(cnt >= m) break;
            ans.push_back({i,j,MX});
            cnt++;
        }
        if(cnt >= m) break;
    }
    cout << MX << " " << MX << endl;
    for(auto& e : ans)
    {
        cout << e.u << " " << e.v << " " << e.w << endl;
    }
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    // cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}